New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption
نویسنده
چکیده
We propose adaptively secure attribute-based encryption (ABE) schemes for boolean formulas over large universe attributes from the decisional linear (DLIN) assumption, which allow attribute reuse in an available formula without the previously employed redundant multiple encoding technique. Thus our KP-(resp. CP-)ABE has non-redundant ciphertexts (resp. secret keys). For achieving the results, we develop a new encoding method for access policy matrix for ABE, by decoupling linear secret sharing (LSS) into its matrix and randomness, and partially randomizing the LSS shares in simulation. The new techniques are of independent interest and we expect it will find another application than ABE.
منابع مشابه
New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption and Their Application
We propose adaptively secure attribute-based encryption (ABE) schemes for boolean formulas over large universe attributes from the decisional linear (DLIN) assumption, which allow an arbitrary number of attribute reuse in an available formula without the previously employed redundant multiple encoding technique. Based on the key-policy (KP)ABE scheme, we have an adaptively secure communication-...
متن کاملAchieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-s...
متن کاملAdaptively Secure Functional Encryption for Finite Languages from DLIN Assumption
In this paper, we present Functional Encryption (FE) schemes for finite languages from standard static assumption, viz., Decisional Linear (DLIN) assumption. These finite languages are described by Deterministic Finite Automatas (DFAs). Our first scheme is ciphertext-policy functional encryption (CP-FE), where a key SKw is labeled with a string w over a fixed alphabet Σ and a ciphertext CM is a...
متن کاملFully Secure Unbounded Inner-Product and Attribute-Based Encryption
In this paper, we present the first inner-product encryption (IPE) schemes that are unbounded in the sense that the public parameters do not impose additional limitations on the predicates and attributes used for encryption and decryption keys. All previous IPE schemes were bounded, or have a bound on the size of predicates and attributes given public parameters fixed at setup. The proposed unb...
متن کاملDecentralized Attribute-Based Signatures
We present the first decentralized multi-authority attributebased signature (DMA-ABS) scheme, in which no central authority and no trusted setup are required. The proposed DMA-ABS scheme for a large class of (non-monotone) predicates is fully secure (adaptive-predicate unforgeable and perfectly private) under a standard assumption, the decisional linear (DLIN) assumption, in the random oracle m...
متن کامل